Ωmega: Computer Supported Mathematics
نویسندگان
چکیده
The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proof-checked by a computer. Classical theorem proving procedures of today are based on ingenious search techniques to find a proof for a given theorem in very large search spaces – often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to more abstract planning techniques however opened up a new paradigm for mathematical reasoning on a computer and several systems of the new kind now employ a mix of interactive, search based as well as proof planning techniques. The Ωmega system is at the core of several related and well-integrated research projects of the Ωmega research group, whose aim is to develop system support for the working mathematician, in particular it supports proof development at a human oriented level of abstraction. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. Ωmega has many characteristics in common with systems likeNuPrL [ACE00], CoQ [Coq03],Hol [GM93], Pvs [ORR96], and Isabelle [Pau94,NPW02]. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems Clam and λClam at Edinburgh [RSG98,BvHHS90]. 1 http://www.win.tue.nl/automath/ S. Biundo, T. Frühwirth, and G. Palm (Eds.): KI 2004, LNAI 3238, pp. 3–28, 2004. c © Springer-Verlag Berlin Heidelberg 2004 4 Jörg Siekmann and Christoph Benzmüller
منابع مشابه
Deep Inference for Automated Proof Tutoring?
•ΩMEGA [5] is a mathematical assistant system, developed at Saarland University. •The DIALOG project [3] investigates natural language based tutoring of mathematical proofs supported by ΩMEGA. •Student and DIALOG system interact to solve example problems; our running example is: (R ◦ S) = S ◦ R •The task of the DIALOG system’s proof asssesment module: proof step analysis (correctness, relevance...
متن کاملTowards Computer-Assisted Proof Tutoring
We present a recent application area of the proof assistant Ωmega, the teaching of mathematical proofs within an environment for tutorial dialog. We discuss the design of our dialog system prototype for proof tutoring in the light of the requirements imposed by its potential users. Empirical studies investigating those requirements guide the development of the system.
متن کاملΩmega – A Mathematical Assistant System
Classical automated theorem provers can prove non-trivial mathematical theorems in highly specific settings. However they are generally unable to cope with even moderately difficult theorems in mainstream mathematics. While there are many reasons for the failure of the classical search-based paradigm, it is apparent that mathematicians can cope with long and complex proofs and have strategies t...
متن کاملTHE UNIVERSITY OF BIRMINGHAM Proof Planning in Ωmega with Semantic Guidance
Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning uses semantic information as search control heuristics. In this report we describe the realisat...
متن کاملComputer Supported Mathematics with ΩMEGA
Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces—often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to mor...
متن کامل